Planar separator theorem

Results: 128



#Item
11De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:27
12Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of Utah

Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of Utah

Add to Reading List

Source URL: mug.mvapich.cse.ohio-state.edu

Language: English - Date: 2015-11-20 13:17:45
13Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany  Abstract. We consider the multivariate interlace polynomial introduced by Courc

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2012-05-16 12:04:39
14Lecture 25  Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Lecture 25 Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
15Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004

Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:00
16Enumeration of Full Graphs: Onset of the Asymptotic Region L. J. Cowen  D. J. Kleitman y F. Lasaga D. E. Sussman Department of Mathematics

Enumeration of Full Graphs: Onset of the Asymptotic Region L. J. Cowen  D. J. Kleitman y F. Lasaga D. E. Sussman Department of Mathematics

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:21
17On the Intersection of Tolerance and Cocomparability Graphs∗ George B. Mertzios† Shmuel Zaks‡  Abstract

On the Intersection of Tolerance and Cocomparability Graphs∗ George B. Mertzios† Shmuel Zaks‡ Abstract

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2014-10-29 18:44:09
18Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T.

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T.

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
19Exercise 7: Lost in complexity Task 1: Why is everything so hard?!? In this exercise, we always consider connected, simple, weighted graphs G = (V, E, W ), restrict message size to O(log n) bits, and assess worst-case ro

Exercise 7: Lost in complexity Task 1: Why is everything so hard?!? In this exercise, we always consider connected, simple, weighted graphs G = (V, E, W ), restrict message size to O(log n) bits, and assess worst-case ro

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-12-02 10:37:59
20PII: 0012-365X

PII: 0012-365X

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2005-05-30 15:06:00